An evolutionary algorithm for the robust maximum weighted independent set problem
نویسندگان
چکیده
منابع مشابه
An Evolutionary Heuristic for the Maximum Independent Set Problem
|The results obtained from the application of a genetic algorithm, GENEsYs, to the NP-complete maximum independent set problem are reported in this work. In contrast to many other genetic algorithm based approaches that use domain-speciic knowledge, the approach presented here relies on a graded penalty term component of the tness function to penalize infeasible solutions. The method is applied...
متن کاملAn Augmentation Algorithm for the Maximum Weighted Stable Set Problem
Edge projection is a specialization of Lovv asz and Plummer's clique projection when restricted to edges. A concept of augmenting sequences of edge-projections is deened w.r.t. a stable set S. It is then proved the equivalence between the optimality of S and the existence of an augmenting sequence w.r.t. S. This result is then exploited to develop a new tabu-search heuristic for the MaximumStab...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اول3D DNA self-assembly for maximum weighted independent set problem
The problem of finding a maximum weighted independent set (MWIS) is a classical combinatorial optimization problem of graph theory, which has been proved to be NP-complete (NPC). A 2-D DNA tile self-assembly model for solving the problem has been proposed previously, but it still has many deficiencies. In this paper, we will propose a 3-D DNA tile self-assembly model based on 2D DNA tile self-a...
متن کاملA Natural Model and a Parallel Algorithm for Approximately Solving the Maximum Weighted Independent Set Problem
A dynamical model based upon a physical metaphor is described, and a parallel algorithm inspired from the model is developed for approximately solving maximum weight independent set problem. Our model treats an independent set as an attraction game, where vertices of the graph are considered as still bodies and edges as cells attracted by the still bodies corresponding to its extremities. In ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatika
سال: 2020
ISSN: 0005-1144,1848-3380
DOI: 10.1080/00051144.2020.1789364